Chaos Communication: An Overview of Exact, Optimum and Approximate Results Using Statistical Theory
نویسنده
چکیده
This paper overviews exact and optimum results for a type chaos shift-keying (CSK) system, in particular, for the antipodal system in which a bit is transmitted by modulating a chaotic segment and decoded by use of the corresponding unmodulated segment, the so-called reference segment. Both singleand multipleuser versions with both knownand transmittedreference segments are considered, the so-called coherent and non-coherent cases. There are two main themes in the paper – the use of statistical likelihood theory leads to optimum or improved decoders – the bit error performance of decoders can be obtained exactly for chaotic segments which are generated by chaotic maps with explicit convolution forms. As a first use of statistical theory, it will be shown that in the simplest of single-user CSK systems, the correlation decoder is actually the optimal likelihood decoder. An argument is then given [Lawrance et al. ( 2003)] to yield an exact expression for its bit error rate and it is shown how to calculate from it with spreading sequences generated by chaotic maps which have explicit convolutions. The theory leads to a lower bound result which was the original inexact result obtained by Gaussian approximation, and cited by Kolumban et al. (2002) and many others. The exact bit error result is extended to when there is a type of alternating jamming or interference and the role of a key quantity termed the jamming factor (JF) is emphasized. Attention then moves to coherent multiple-user CSK systems, motivated by the extensive approximate Gaussian results in Lau et al. (2003), Tam et al. (2007), and to their optimal decoding following the likelihood route [Lawrance et al. (2008)]. In this way a generalized correlation decoder is derived, generalized in the sense that it employs the autocorrelations of the spreading segment. Exact BER results are obtained and exemplified by calculations using logistic map and Bernoulli map spreading. These are compared with those from the correlation decoder and shown to be particularly superior at the desirable high SNR levels. The structure of the results indicates the roles of SNR and a quantity defined as the spreading to interference ratio (SIR) in determining the BER of such systems; comparisons are also made to the form of Gaussian results. To conclude, some of the earlier correlation decoder results are extended and compared to non-coherent systems in terms of BER, both in the singleand multiple-user cases. Comments concerning the improved design of noncoherent systems, following Yao et al. (2006), and areas awaiting investigation, conclude the presentation.
منابع مشابه
Chaos Communication Performance: Theory and Computation
In this paper new and existing approaches are developed to compute the bit error rate for chaos-based communication systems. The multi-user coherent antipodal chaos shift keying system is studied and evaluated in its coherent form, in the sense of perfect synchronization between transmitted and received chaotic sequences. Transmission is through an additive white Gaussian noise channel. Four me...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملA Novel Image Encryption Model Based on Hybridization of Genetic Algorithm, Chaos Theory and Lattice Map
Encryption is an important issue in information security which is usually provided using a reversible mathematical model. Digital image as a most frequently used digital product needs special encryption algorithms. This paper presents a new encryption algorithm high security for digital gray images using genetic algorithm and Lattice Map function. At the first the initial value of Logistic Map ...
متن کاملThe Assessment of Applying Chaos Theory for Daily Traffic Estimation
Road traffic volumes in intercity roads are generally estimated by probability functions, statistical techniques or meta-heuristic approaches such as artificial neural networks. As the road traffic volumes depend on input variables and mainly road geometrical design, weather conditions, day or night time, weekend or national holidays and so on, these are also estimated by pattern recognition te...
متن کاملImproving security of double random phase encoding with chaos theory using fractal images
This study presents a new method based on the combination of cryptography and information hiding methods. Firstly, the image is encoded by the Double Random Phase Encoding (DRPE) technique. The real and imaginary parts of the encoded image are subsequently embedded into an enlarged normalized host image. DRPE demands two random phase mask keys to decode the decrypted image at the destination. T...
متن کامل